Extremal Dependencies and Rank Correlations in Power Law Networks
نویسندگان
چکیده
We analyze dependencies in complex networks characterized by power laws (Web sample, Wikipedia sample and a preferential attachment graph) using statistical techniques from the extreme value theory and the theory of multivariate regular variation. To the best of our knowledge, this is the first attempt to apply this well developed methodology to comprehensive graph data. The new insights this yields are striking: the three above-mentioned data sets are shown to have a totally different dependence structure between graph parameters, such as in-degree and PageRank. Based on the proposed approach, we suggest a new measure for rank correlations. Unlike most known methods, this measure is especially sensitive to rank permutations for top-ranked nodes. Using the new correlation measure, we demonstrate that the PageRank ranking is not sensitive to moderate changes in the damping factor.
منابع مشابه
A framework for evaluating statistical dependencies and rank correlations in power law graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. To the best of our knowledge, this is the first attempt to apply the well developed theory of regular variation to graph data. The new insights this yields are striking: the three above-mentioned data sets are shown to...
متن کاملUncovering disassortativity in large scale-free networks.
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, and social and biological networks, are often characterized by degree-degree dependencies between neighboring nodes. In this paper, we propose a new way of measuring degree-degree dependencies. One of the problems with the commonly used assortativity coefficient is that in disassortative networks its ma...
متن کاملA large-scale study of the World Wide Web: network correlation functions with scale-invariant boundaries
We performed a large-scale crawl of the World Wide Web, covering 6.9 Million domains, including all high-traffic sites of the Internet. We present a study of the correlations found between quantities measuring the structural relevance of each node in the network (the inand out-degree, the local clustering coefficient, the first-neighbor in-degree and the Alexa rank). We find that some of these ...
متن کاملDegree-degree correlations in random graphs with heavy-tailed degrees
We investigate degree-degree correlations for scale-free graph sequences. The main conclusion of this paper is that the assortativity coefficient is not the appropriate way to describe degreedependences in scale-free random graphs. Indeed, we study the infinite volume limit of the assortativity coefficient, and show that this limit is always non-negative when the degrees have finite first but i...
متن کاملImproving the Performance of RPL Routing Protocol for Internet of Things
The emerging Internet of Things (IoT) connects the physical world to the digital one and composes large networks of smart devices to support various applications. In order to provide a suitable communication in such networks, a reliable routing protocol is needed. In this paper, a modified version of an IPv6 Routing Protocol for Low-Power and Lossy networks (RPL), which has been standardized by...
متن کامل